Plane overpartitions and cylindric partitions
نویسندگان
چکیده
Generating functions of plane overpartitions are obtained using various methods: non–intersecting paths, RSK type algorithms and symmetric functions. We extend some of the results to cylindric partitions. Also, we show that plane overpartitions correspond to domino tilings and we give some basic properties of this correspondence.
منابع مشابه
THREE COMBINATORIAL MODELS FOR ŝln CRYSTALS, WITH APPLICATIONS TO CYLINDRIC PLANE PARTITIONS
We define three combinatorial models for b sln crystals, parametrized by partitions, configurations of beads on an “abacus”, and cylindric plane partitions, respectively. These are reducible, but we can identify an irreducible subcrystal corresponding to any dominant integral highest weight Λ. Cylindric plane partitions actually parametrize a basis for VΛ ⊗ F , where F is the space spanned by p...
متن کاملEXPLICIT ŝln CRYSTAL MAPS BETWEEN CYLINDRIC PLANE PARTITIONS, MULTI-PARTITIONS AND MULTI-SEGMENTS
There are many combinatorial realizations of the crystals BΛ for the integral highest weight representations of b sln. One of the earliest and perhaps best known has as it’s underlying set certain `-tuples of partitions, where ` is the level of the representation. Another more recent model has as it’s underlying set certain cylindric plane partitions. Here we present a simple crystal isomorphis...
متن کاملEnumeration of Cylindric Plane Partitions
Résumé. Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. As in the reverse plane partition case, the right hand side of this identity admits a simple factorization form in terms of the “hook lengths” of the individual boxes in the underlying s...
متن کاملSingular Overpartitions
The object in this paper is to present a general theorem for overpartitions analogous to Rogers-Ramanujan type theorems for ordinary partitions with restricted successive ranks.
متن کاملLegendre theorems for subclasses of overpartitions
A. M. Legendre noted that Euler’s pentagonal number theorem implies that the number of partitions of n into an even number of distinct parts almost always equals the number of partitions of n into an odd number of distinct parts (the exceptions occur when n is a pentagonal number). Subsequently other classes of partitions, including overpartitions, have yielded related Legendre theorems. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011